https://ogma.newcastle.edu.au/vital/access/ /manager/Index ${session.getAttribute("locale")} 5 https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:31515 v of a connected graph G (V, E) and a subset S of V, the distance between v and S is defined by d(v,S)=min{d(v,x):x∈S}. For an ordered k.-partition Π={S₁,S₂,…,S_k} of V, the representation of v with respect to Π is the k-vector r(v∣Π)=(d(v,S₁),d(v,S₂),…,d(v,S_k)). The k-partition Π is a resolving partition if the k-vectors r(v∣Π), v∈V are distinct. The minimum k for which there is a resolving k-partition of V is the partition dimension of G. In this paper, we obtain the partition dimension of circulant graphs [formula cannot be replicated]]]> Sat 24 Mar 2018 08:43:35 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:17583 Sat 24 Mar 2018 08:03:58 AEDT ]]>